Probabilistic analysis of algorithms - PDFSEARCH.IO - Document Search Engine

Probabilistic analysis of algorithms
Results: 137

#	Item
21	arXiv:1209.5993v4 [cs.CC] 11 SepGeometric Complexity Theory V: Equivalence between blackbox derandomization of polynomial identity testing and derandomization of Noether’s Normalization Lemma Dedicated to Sri Ra Add to Reading List Source URL: gct.cs.uchicago.edu Language: English - Date: 2013-11-07 17:14:04 Analysis of algorithms Invariant theory Probabilistic complexity theory Randomized algorithm Time complexity Emmy Noether SC Polynomial Circuit complexity Theoretical computer science Computational complexity theory Mathematics
22	CPS296.2 Geometric Optimization February 22, 2007 Lecture 13: 1-Center, 1-Median problems Lecturer: Pankaj K. Agarwal Add to Reading List Source URL: www.cs.duke.edu Language: English - Date: 2007-04-05 11:46:26 Randomized algorithm Mathematics Computational geometry Coding theory Applied mathematics Finite fields Theoretical computer science Analysis of algorithms Probabilistic complexity theory
23	Randomized Loose Renaming in O(log log n) Time [Extended Abstract] ∗ † Add to Reading List Source URL: cs-www.cs.yale.edu Language: English - Date: 2015-04-30 10:34:00 Analysis of algorithms Probabilistic complexity theory Randomized algorithm Time complexity Algorithm Poisson distribution SL Theoretical computer science Computational complexity theory Applied mathematics
24	Randomized Distributed Decision Pierre Fraigniaud1 , Amos Korman1? , Merav Parter2 , and David Peleg2?? 1 CNRS and University Paris Diderot, France . {pierre.fraigniaud,amos.korman}@liafa.jussieu.fr Add to Reading List Source URL: www.liafa.jussieu.fr Language: English - Date: 2012-10-01 06:03:40 Randomized algorithm XTR Applied mathematics Mathematics Theoretical computer science Analysis of algorithms Probabilistic complexity theory
25	Exercise 1 (A streaming algorithm for counting the number of distinct values). [⋆] We are given a stream of numbers x1 , . . . , xn ∈ [m] and we want to compute the number of distinct values in the stream: F0 (x) = Add to Reading List Source URL: www.liafa.univ-paris-diderot.fr Language: English - Date: 2015-01-19 07:51:43 Analysis of algorithms Probabilistic complexity theory Randomized algorithm
26	Tight Bounds for Lp Samplers, Finding Duplicates in Streams, and Related Problems arXiv:1012.4889v1 [cs.DS] 22 DecHossein Jowhari1 , Mert Sa˘glam1 , and G´abor Tardos1,2 Add to Reading List Source URL: arxiv.org Language: English - Date: 2010-12-22 20:04:48 Analysis of algorithms Probabilistic complexity theory Quantum complexity theory Randomized algorithm Chernoff bound PP Big O notation Theoretical computer science Computational complexity theory Applied mathematics
27	A subexponential lower bound for the Random Facet algorithm for Parity Games Oliver Friedmann∗ Thomas Dueholm Hansen† Add to Reading List Source URL: files.oliverfriedmann.de Language: English - Date: 2012-02-10 07:43:15 Probabilistic complexity theory Randomized algorithm Permutation Structure LP-type problem Mathematics Theoretical computer science Analysis of algorithms
28	Noname manuscript No. (will be inserted by the editor) Faster Randomized Consensus With an Oblivious Adversary James Aspnes Add to Reading List Source URL: cs-www.cs.yale.edu Language: English - Date: 2015-04-30 10:34:00 Analysis of algorithms Probabilistic complexity theory Consensus Randomized algorithm Time complexity SL Iterated logarithm Theoretical computer science Computational complexity theory Applied mathematics
29	Exercise 1 (A streaming algorithm for the second moment of the frequencies). We are given a stream of numbers x1 , . . . , xn ∈ {0, . . . , m − 1} and we want to compute the sum of the squares of the frequencies of Add to Reading List Source URL: www.liafa.univ-paris-diderot.fr Language: English - Date: 2015-01-19 07:51:43 Probabilistic complexity theory Randomized algorithm Logarithm Applied mathematics Computational complexity theory Errors-in-variables models Normal distribution Theoretical computer science Mathematics Analysis of algorithms
30	Sub-Logarithmic Test-and-Set Against a Weak Adversary? Dan Alistarh1 and James Aspnes2 1 2 Add to Reading List Source URL: cs-www.cs.yale.edu Language: English - Date: 2015-04-30 10:33:59 Analysis of algorithms Probabilistic complexity theory Randomized algorithm Consensus Algorithm Time complexity Adversary model Logarithm Theoretical computer science Computational complexity theory Applied mathematics

UPDATE